Equivalence Models for Quantified Boolean Formulas
نویسندگان
چکیده
In this paper, the notion of equivalence models for quantified Boolean formulas with free variables is introduced. The computational complexity of the equivalence model checking problem is investigated in the general case and some restricted cases. We also establish a connection between the structure of some quantified Boolean formulas and the structure of models.
منابع مشابه
Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas
In this paper, quantified Horn formulas with free variables (QHORN∗) are investigated. The main result is that any quantified Horn formula Φ of length |Φ| with free variables, |∀| universal quantifiers and an arbitrary number of existential quantifiers can be transformed into an equivalent formula of length O(|∀| · |Φ|) which contains only existential quantifiers. Moreover, it is shown that qua...
متن کاملEncoding Nested Boolean Functions as Quantified Boolean Formulas
In this paper, we consider the problem of compactly representing nested instantiations of propositional subformulas with different arguments as quantified Boolean formulas (QBF). We develop a generic QBF encoding pattern which combines and generalizes existing QBF encoding techniques for simpler types of redundancy. We obtain an equivalence-preserving transformation in linear time from the PSPA...
متن کاملModels and quantifier elimination for quantified Horn formulas
In this paper, quantified Horn formulas (QHORN) are investigated. We prove that the behavior of the existential quantifiers depends only on the cases where at most one of the universally quantified variables is zero. Accordingly, we give a detailed characterization of QHORN satisfiability models which describe the set of satisfying truth assignments to the existential variables. We also conside...
متن کاملTransformations into Normal Forms for Quantified Circuits
We consider the extension of Boolean circuits to quantified Boolean circuits by adding universal and existential quantifier nodes with semantics adopted from quantified Boolean formulas (QBF). The concept allows not only prenex representations of the form ∀x1∃y1...∀xn∃yn c where c is an ordinary Boolean circuit with inputs x1, ..., xn, y1, ..., yn. We also consider more general non-prenex norma...
متن کاملOn Models for Quantified Boolean Formulas
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substituting the existential variables by the Boolean functions results in a true formula. We call a satisfying set of Boolean functions a model. In this paper, we investigate for various classes of quantified Boolean formul...
متن کامل